Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
181	Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-01-27 11:28:33 Computability theory Theory of computation Mathematics Theoretical computer science Mathematical analysis Computable function Sigma-algebra Generalised Whitehead product
182	Microsoft PowerPoint - DIALMPOMC03.ppt Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:49 Graph theory NP-complete problems Wireless networking Unit disk graph Routing algorithms Wireless ad hoc network Routing Topology control Topological graph theory Planar graph Geographic routing Graph coloring
183	B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem Add to Reading List Source URL: www.caam.rice.edu Language: English - Date: 2006-08-14 16:34:49 Graph theory NP-complete problems Clique Degeneracy Dominating set Independent set Graph Degree Graph coloring Extremal graph theory
184	JMLR: Workshop and Conference Proceedings vol 40:1–13, 2015 Online Learning with Feedback Graphs: Beyond Bandits Noga Alon NOGAA @ POST. TAU . AC . IL Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 Graph theory Mathematics NP-complete problems Graph Dominating set Graph coloring Ear decomposition Directed graph Matching Line graph
185	JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 NP-complete problems Analysis of algorithms Clique problem Planted clique Time complexity Clique Matching Big O notation Matching polynomial Graph coloring
186	U NIVERSITÉ PARIS D IDEROT – PARIS VII S ORBONNE PARIS C ITÉ É COLE D OCTORALE S CIENCES M ATHÉMATIQUES DE PARIS C ENTRE THÈSE en vue d’obtenir le grade de Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2016-02-09 12:07:59 Computability theory Ramsey theory Theorem Graph coloring Reverse mathematics
187	Institute of Parallel and Distributed Systems PowerSwitch Add to Reading List Source URL: ipads.se.sjtu.edu.cn Language: English - Date: 2014-11-24 03:52:00 Graph coloring Crowdsourcing PageRank Reputation management Search engine optimization GraphLab
188	Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem Add to Reading List Source URL: acmsocc.github.io Language: English - Date: 2016-02-21 03:10:50 Graph theory NP-complete problems Bipartite graphs Graph Tree Graph coloring Pathwidth Modular decomposition
189	GraphLab: A New Framework For Parallel Machine Learning Yucheng Low Carnegie Mellon University Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2010-06-15 17:18:40 Graph theory Concurrent computing Mathematics Parallel computing Distributed computing architecture NP-complete problems Graph connectivity MapReduce Speedup Graph coloring Spanning tree Graph partition
190	Using discharging methods For the coloring of sparse graphs M2 internship Benjamin Lévêque & Alexandre Pinlou Marthe Bonamy LIRMM, Montpellier Add to Reading List Source URL: www.labri.fr Language: English - Date: 2015-12-18 08:48:25 Graph theory Graph coloring Discharging method Four color theorem Planar graph Tree Line graph Graph minor

UPDATE